Linearization of Logical Functions Defined by a Set of Orthogonal Terms. I. Theoretical Aspects
نویسندگان
چکیده
Consideration was given to the linearization of logical functions defined by a set of pairwise orthogonal terms. The linearization is carried out by computing the autocorrelation functions. Proposed was a method consisting of (i) calculation of the autocorrelation function in the space of orthogonal terms, (ii) generation of the corresponding matrix of linear transformation, and (iii) the linear transformation proper of the variables in the space of orthogonal terms. Complexity of the proposed method and its effectiveness were estimated. Effectiveness was verified by a series of experiments with standard benchmarks. The distinctions of the proposed method from other existing methods of linearization were examined. DOI: 10.1134/S0005117911030118
منابع مشابه
Simultaneous Spectrophotometric Determination of Heavy Metal Ions Using Several Chemometrics Methods: Effect of Different Parameters of Savitzky-Golay and Direct Orthogonal Signal Correction Filters
Direct orthogonal signal correction(DOSC) and Savitzky-Golay filters (SGF) were applied as preprocessing methods on the original and first derivative absorbance data. Principle component regression (PCR), partial least squares (PLS) and iterative target transformation factor analysis (ITTFA), were used in spectrophotometric simultaneous determination of heavy divalent metal ions, l...
متن کاملContractive gauge functions in strongly orthogonal metric spaces
Existence of fixed point in orthogonal metric spaces has been initiated recently by Eshaghi and et al. [On orthogonal sets and Banach fixed Point theorem, Fixed Point Theory, in press]. In this paper, we introduce the notion of the strongly orthogonal sets and prove a genuine generalization of Banach' fixed point theorem and Walter's theorem. Also, we give an example showing that our main theor...
متن کاملThe Italian domatic number of a digraph
An {em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function$fcolon V(D)to {0, 1, 2}$ such that every vertex $vin V(D)$ with $f(v)=0$ has at least two in-neighborsassigned 1 under $f$ or one in-neighbor $w$ with $f(w)=2$. A set ${f_1,f_2,ldots,f_d}$ of distinctItalian dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vi...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملGeneral linearization formulae for products of continuous hypergeometric-type polynomials
The linearization of products of wavefunctions of exactly solvable potentials often reduces to the generalized linearization problem for hypergeometric polynomials (HPs) of a continuous variable, which consists of the expansion of the product of two arbitrary HPs in series of an orthogonal HP set. Here, this problem is algebraically solved directly in terms of the coefficients of the second-ord...
متن کامل